SVMTOCP: A Binary Tree Base SVM Approach through Optimal Multi-class Binarization
نویسندگان
چکیده
The tree architecture has been employed to solve multi-class problems based on SVM. It is an alternative to the well known OVO/OVA strategies. Most of the tree base SVM classifiers try to split the multi-class space, mostly, by some clustering like algorithms into several binary partitions. One of the main drawbacks of this is that the natural class structure is not taken into account. Also the same SVM parameterization is used for all classifiers. Here a preliminary and promising result of a multi-class space partition method that account for data base class structure and allow node‘s parameter specific solutions is presented. In each node the space is split into two class problem possibilities and the best SVM solution found. Preliminary results show that accuracy is improved, lesser information is required, each node reaches specific cost values and hard separable classes can easily be identified.
منابع مشابه
Efficient Approach Multiclass SVM For Vowels Recognition
In this paper we present and investigate the performance of a simple framework for multiclass problems of support vector machine (SVM), we present a new approach named EAMSVM (Efficient Approach Multiclass SVM), in order to achieve high classification efficiency for multiclass problems. The proposed paradigm builds a binary tree for multiclass SVM by genetic algorithms with the aim of obtaining...
متن کاملOne-Vs-All Binarization Technique in the Context of Random Forest
Binarization techniques are widely used to solve multi-class classification problems. These techniques reduce the classification complexity of multi-class classification problems by dividing the original data set into two-class segments or replicas. Then a set of simpler classifiers are learnt from the two-class segments or replicas. The outputs from these classifiers are combined for final cla...
متن کاملEvaluation of Distance Measures for Multi-class Classification in Binary SVM Decision Tree
Multi-class classification can often be constructed as a generalization of binary classification. The approach that we use for solving this kind of classification problem is SVM based Binary Decision Tree architecture (SVM-BDT). It takes advantage of both the efficient computation of the decision tree architecture and the high classification accuracy of SVMs. The hierarchy of binary decision su...
متن کاملAutomatic Construction Algorithm for Multi-class Support Vector Machines with Binary Tree Architecture
Multi-class support vector machines with binary tree architecture (SVM-BTA) have the fastest decision-making speed in the existing multi-class SVMs. But SVM-BTA usually has bad classification capability. According to internal characteristics of feature samples, this paper uses resemblance coefficient method to construct automatically binary tree to incorporate multiple binary SVMs. The multi-cl...
متن کاملMulti-class Classification Using Support Vector Machines in Binary Tree Architecture
This paper presents architecture of Support Vector Machine classifiers arranged in a binary tree structure for solving multi-class classification problems with increased efficiency. The proposed SVM based Binary Tree Architecture (SVM-BTA) takes advantage of both the efficient computation of the tree architecture and the high classification accuracy of SVMs. Clustering algorithm is used to conv...
متن کامل